Numerical experiments on quadratically convergent algorithms for function minimization
نویسندگان
چکیده
منابع مشابه
Quadratically and Superlinearly Convergent Algorithms for the Solution of Inequality Constrained Minimization Problems 1
In this paper some Newton and quasi-Newton algorithms for the solution of inequality constrained minimization problems are considered. All the algorithms described produce sequences fx k g converging q-superlinearly to the solution. Furthermore , under mild assumptions, a q-quadratic convergence rate in x is also attained. Other features of these algorithms are that the solution of linear syste...
متن کاملApproximate Zeros of Quadratically Convergent Algorithms
Smale's condition for a point to be an approximate zero of a function for Newton's method is extended to the general quadratically convergent iterative algorithm. It is shown in which way the bound in the condition is affected by the characteristics of the algorithm. This puts the original condition of Smale for Newton's method in a more general perspective. The results are also discussed in th...
متن کاملOn convergent numerical algorithms for unsymmetric collocation
In this paper, we are interested in some convergent formulations for the unsymmetric collocation method or the so-called Kansa’s method. We review some newly developed theories on solvability and convergence. The rates of convergence of these variations of Kansa’s method are examined and verified in arbitrary–precision computations. Numerical examples confirm with the theories that the modified...
متن کاملQuadratically convergent algorithms for optimal dextrous hand grasping
There is a robotic balancing task, namely real-time dextrous-hand grasping, for which linearly constrained, positive definite programming gives a quite satisfactory solution from an engineering point of view. We here propose refinements of this approach to reduce the computational effort. The refinements include elimination of structural constraints in the positive definite matrices, orthogonal...
متن کاملA quadratically convergent VBSCF method.
A quadratically convergent valence bond self-consistent field method is described where the simultaneous optimisation of orbitals and the coefficients of the configurations (VB structures) is based on a Newton-Raphson scheme. The applicability of the method is demonstrated in actual calculations. The convergence and efficiency are compared with the Super-CI method. A necessary condition to achi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization Theory and Applications
سال: 1970
ISSN: 0022-3239,1573-2878
DOI: 10.1007/bf00926604